<title>元</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-k">const</span> <span class="pl-kt">int</span> <span class="pl-n">MAXN</span><span class="pl-o">=</span><span class="pl-mi">100010</span><span class="pl-p">;</span>
<span class="pl-k">struct</span> <span class="pl-n">edge</span><span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">to</span><span class="pl-p">,</span><span class="pl-n">next</span><span class="pl-p">;</span>
<span class="pl-p">}</span> <span class="pl-n">edges</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-o">*</span><span class="pl-mi">2</span><span class="pl-p">];</span>
<span class="pl-kt">char</span> <span class="pl-n">opt</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">],</span><span class="pl-n">fa</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">],</span><span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-o">*</span><span class="pl-mi">2</span><span class="pl-p">],</span><span class="pl-n">tot</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-n">black</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">];</span>
<span class="pl-kt">void</span> <span class="pl-nf">add</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">y</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-n">edges</span><span class="pl-p">[</span><span class="pl-o">++</span><span class="pl-n">tot</span><span class="pl-p">].</span><span class="pl-n">to</span><span class="pl-o">=</span><span class="pl-n">y</span><span class="pl-p">;</span>
    <span class="pl-n">edges</span><span class="pl-p">[</span><span class="pl-n">tot</span><span class="pl-p">].</span><span class="pl-n">next</span><span class="pl-o">=</span><span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">];</span>
    <span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">tot</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">find</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-p">){</span><span class="pl-k">return</span> <span class="pl-n">x</span><span class="pl-o">==</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]</span><span class="pl-o">?</span><span class="pl-nl">x</span><span class="pl-p">:(</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]));}</span>
<span class="pl-kt">void</span> <span class="pl-nf">join</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">b</span><span class="pl-p">){</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">a</span><span class="pl-p">)]</span><span class="pl-o">=</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">b</span><span class="pl-p">);}</span>
<span class="pl-kt">void</span> <span class="pl-nf">dfs</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">father</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">black</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">])</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">x</span><span class="pl-p">;</span>
    <span class="pl-k">else</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">father</span><span class="pl-p">;</span>
    <span class="pl-n">fa</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">father</span><span class="pl-p">;</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">];</span><span class="pl-n">i</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-n">edges</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">next</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-kt">int</span> <span class="pl-n">v</span><span class="pl-o">=</span><span class="pl-n">edges</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">to</span><span class="pl-p">;</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-o">==</span><span class="pl-n">father</span><span class="pl-p">)</span> <span class="pl-k">continue</span><span class="pl-p">;</span>
        <span class="pl-n">dfs</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-p">,</span><span class="pl-n">x</span><span class="pl-p">);</span>
    <span class="pl-p">}</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">][</span><span class="pl-mi">3</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;yuan.in&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;r&quot;</span><span class="pl-p">,</span><span class="pl-n">stdin</span><span class="pl-p">);</span>
    <span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;yuan.out&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;w&quot;</span><span class="pl-p">,</span><span class="pl-n">stdout</span><span class="pl-p">);</span>
    <span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">m</span><span class="pl-p">;</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">);</span>
    <span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-n">b</span><span class="pl-p">;</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">b</span><span class="pl-p">);</span>
        <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-n">b</span><span class="pl-p">);</span>
        <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">b</span><span class="pl-p">,</span><span class="pl-n">a</span><span class="pl-p">);</span>
    <span class="pl-p">}</span>
    <span class="pl-n">black</span><span class="pl-p">[</span><span class="pl-mi">1</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-nb">true</span><span class="pl-p">;</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot; %c%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">opt</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">]);</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">opt</span><span class="pl-o">==</span><span class="pl-sc">&#39;Q&#39;</span><span class="pl-p">){</span>
            <span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">0</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
        <span class="pl-p">}</span><span class="pl-k">else</span><span class="pl-p">{</span>
            <span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">0</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span>
            <span class="pl-n">black</span><span class="pl-p">[</span><span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">]]</span><span class="pl-o">++</span><span class="pl-p">;</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-n">dfs</span><span class="pl-p">(</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">);</span>
    <span class="pl-n">fa</span><span class="pl-p">[</span><span class="pl-mi">1</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&gt;=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-o">--</span><span class="pl-n">i</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">0</span><span class="pl-p">])</span> <span class="pl-p">{</span>
            <span class="pl-n">black</span><span class="pl-p">[</span><span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">]]</span><span class="pl-o">--</span><span class="pl-p">;</span>
            <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">black</span><span class="pl-p">[</span><span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">]])</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">]]</span><span class="pl-o">=</span><span class="pl-n">fa</span><span class="pl-p">[</span><span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">]];</span>
        <span class="pl-p">}</span> <span class="pl-k">else</span> <span class="pl-p">{</span> 
            <span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">2</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">]);</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">0</span><span class="pl-p">])</span> <span class="pl-p">{</span>
            <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">que</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">2</span><span class="pl-p">]);</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>